Do hypercubes sort faster than tree machines?
نویسنده
چکیده
SUMMARY We develop a balanced, parallel quicksort algorithm for a hypercube and compare it with a similar algorithm for a binary tree machine. The performance of the hypercube algorithm is measured on a Computing Surface.
منابع مشابه
Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs
We present algorithms that run in linear time on pointer machines for a collection of problems, each of which either directly or indirectly requires the evaluation of a function defined on paths in a tree. These problems previously had linear-time algorithms but only for random-access machines (RAMs); the best pointer-machine algorithms were super-linear by an inverse-Ackermann-function factor....
متن کاملEmbedding of Tree Machines into Hypercubes
In this paper, we present that a tree machine can be embedded into incomplete hypercube with expansion 1, load 1, dilation 2 and congestion 2. This result is better than the expansion (2+2)/(2+2-2) in [14]. Then we consider how to embed a large tree machine into a hypercube for considering load-balance. We have shown that a tree machine TMh (h1) can be embedded into a hypercube Hh+1 with dilat...
متن کاملSelf-diagnosability Results and Diagnosis Algorithms for Hypercubes and Star Graphs
Our purpose in the present paper is to do a detailed investigation of the diierent aspects of t-diagnosability and t=t-diagnosability of hypercubes and star graphs. We compute that the degree of diagnosability of a star graph S n is 2n ? 4 (that of a hypercube is 2n ? 2 4]). We then propose a simple yet eecient algorithm to locate faults in hypercubes and star graphs under both t-diagnosis and ...
متن کاملImproved Probabilistic Routing on Generalized Hypercubes
p. 1 Efficient Data Communication in Incomplete Hypercubes p. 13 Efficient Communication in the Folded Petersen Interconnection Networks p. 25 Compiling Rewriting onto SIMD and MIMD/SIMD Machines p. 37 A Compilation Technique for Varying Communication Cost NUMA Architectures p. 49 A Data Partitioning Algorithm for Distributed Memory Compilation p. 61 Towards a High Precision Massively Parallel ...
متن کاملComparison of Bucket Sort and RADIX Sort
Bucket sort and RADIX sort are two well-known integer sorting algorithms. This paper measures empirically what is the time usage and memory consumption for different kinds of input sequences. The algorithms are compared both from a theoretical standpoint but also on how well they do in six different use cases using randomized sequences of numbers. The measurements provide data on how good they ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Concurrency - Practice and Experience
دوره 6 شماره
صفحات -
تاریخ انتشار 1994